Euclid after Computer Proof-Checking
نویسندگان
چکیده
Euclid pioneered the concept of a mathematical theory developed from axioms by series justified proof steps. From outset there were critics and improvers. In this century use computers to check proofs for correctness sets new standard rigor. How does stand up under such an examination? And what exercise have teach us about geometry, foundations, relation logic truth?
منابع مشابه
Proof-checking Euclid
We used computer proof-checking methods to verify the correctness of our proofs of the propositions in Euclid Book I. We used axioms as close as possible to those of Euclid, in a language closely related to that used in Tarski’s formal geometry. We used proofs as close as possible to those given by Euclid, but filling Euclid’s gaps and correcting errors. Euclid Book I has 48 propositions; we pr...
متن کاملProof Checking the Proof
2a) Summary. It is considered a fact of life that all serious computer programs contain errors, so-called ‘bugs’. Empirical data indicates that production software has around two bugs per thousand lines of source code, and even programs used on space missions by NASA are believed to have around 0.1 bugs per thousand lines of code [26]. Interactive theorem proving is a technology for building pr...
متن کاملProof Checking Using Experience
Checking Mathematics proofs is a complex task which needs experience. Yet most AI approaches to proof checking tend to use general methods rather than knowledge rich approaches. The program MU, Mathematics Understander, reads mathematics texts expressed in the Formal Expression Language (FEL), and provides explanations of the proof steps. MU has successfully checked proofs in group theory and c...
متن کاملTowards Lean Proof Checking
Logical formal systems are ineecient at computations. In order to increase their eeciency, we aim to extend these systems with computational power. In this paper, we suggest a general, powerful syntax, called oracle types, to extend type theories with computational power; the resulting systems, which combine the logical abilities of logical formal systems and the computational power of term rew...
متن کاملInteractive and probabilistic proof-checking
The notion of efficient proof-checking has always been central to complexity theory, and it gave rise to the definition of the class NP. In the last 15 years there has been a number of exciting, unexpected and deep developments in complexity theory that exploited the notion of randomized and interactive proof-checking. Results developed along this line of research have diverse and powerful appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Mathematical Monthly
سال: 2022
ISSN: ['1930-0972', '0002-9890']
DOI: https://doi.org/10.1080/00029890.2022.2069985